One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture

نویسنده

Ken-ichi Kawarabayashi

چکیده

1 Research partly supported by the Japan Society for the Promotion of Science for Young Scientists. Department of Mathematics, Faculty of Science and Technology, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, Yokohama 223-8522, Japan; and Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, Tennessee 37240-0001 E-mail: [email protected], [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disjoint dijoins

A “dijoin” in a digraph is a set of edges meeting every directed cut. D. R. Woodall conjectured in 1976 that if G is a digraph, and every directed cut of G has at least k edges, then there are k pairwise disjoint dijoins. This remains open, but a capacitated version is known to be false. In particular, A. Schrijver gave a digraph G and a subset S of its edge-set, such that every directed cut co...

متن کامل

The structure of bullfree graphs

The bull is a graph consisting of a triangle and two disjoint pendant edges. Obvious examples of bullfree graphs are graphs with no triangle, or graphs with no stable set of size three. But there are others (for examples substituting one bullfree graph into another produces another bullfree graphs). It turns out, however, that one can explicitly describe all bullfree graphs that cannon be const...

متن کامل

A note on the Erdos-Farber-Lovász conjecture

A hypergraph H is linear if no two distinct edges of H intersect in more than one vertex and loopless if no edge has size one. A q-edge-colouring of H is a colouring of the edges of H with q colours such that intersecting edges receive different colours. We use ∆H to denote the maximum degree of H. A well known conjecture of Erdös, Farber and Lovász is equivalent to the statement that every loo...

متن کامل

The Erd\H{o}s-Hajnal conjecture for caterpillars and their complements

The celebrated Erdős-Hajnal conjecture states that for every proper hereditary graph class G there exists a constant ε = ε(G) > 0 such that every graph G ∈ G contains a clique or an independent set of size |V (G)|. Recently, there has been a growing interest in the symmetrized variant of this conjecture, where one additionally requires G to be closed under complementation. We show that any here...

متن کامل